Strong Integer Additive Set-Valued Graphs: A Creative Review

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Strong Integer Additive Set-Valued Graphs: A Creative Review

For a non-empty ground set X, finite or infinite, the set-valuation or set-labeling of a given graph G is an injective function f : V (G) ! P(X) such that the induced edge-function f : E(G) ! P(X) ?? f;g is defined by f (uv) = f(u) f(v) for every uv2E(G), where P(X) is the power set of the set X and is a binary operation on sets. A set-indexer of a graph G is an set-labeling f : V (G) such that...

متن کامل

Topological Integer Additive Set-Graceful Graphs

Let N0 denote the set of all non-negative integers and X be any subset of X. Also denote the power set of X by P(X). An integer additive set-labeling (IASL) of a graph G is an injective function f : V (G) ! P(X) such that the induced function f+ : E(G) ! P(X) is defined by f+(uv) = f(u) + f(v), where f(u) + f(v) is the sumset of f(u) and f(v). An IASL f is said to be a topological IASL (Top-IAS...

متن کامل

Weak Set-Labeling Number of Certain Integer Additive Set-Labeled Graphs

Let N0 be the set of all non-negative integers, let X N0 and P(X) be the the power set of X. An integer additive set-labeling (IASL) of a graph G is an injective function f : V (G) ! P(N0) such that the induced function f+ : E(G) ! P(N0) is defined by f+(uv) = f(u) + f(v), where f(u) + f(v) is the sum set of f(u) and f(v). An IASL f is said to be an integer additive set-indexer (IASI) of a grap...

متن کامل

A study on prime arithmetic integer additive set-indexers of graphs

Let N0 be the set of all non-negative integers and P(N0) be its power set. An integer additive set-indexer (IASI) is defined as an injective function f : V (G) → P(N0) such that the induced function f : E(G)→ P(N0) defined by f(uv) = f(u)+f(v) is also injective, where N0 is the set of all non-negative integers. A graph G which admits an IASI is called an IASI graph. An IASI of a graph G is said...

متن کامل

Additive super-efficiency in integer-valued data envelopment analysis

Conventional data envelopment analysis (DEA) methods assume that input and output variables are continuous. However, in many real managerial cases, some inputs and/or outputs can only take integer values. Simply rounding the performance targets to the nearest integers can lead to misleading solutions and efficiency evaluation. Addressing this kind of integer-valued data, the current paper propo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of Computer Applications

سال: 2015

ISSN: 0975-8887

DOI: 10.5120/20136-2254